A Sequential Algorithm for Generating Random Graphs

A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erdős and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The algorithm is easy to implement and allows su...

Generating Random Outerplanar Graphs

Generating Random Regular Graphs Quickly

There are various algorithms known for generating graphs with n vertices of given degrees uniformly at random. Unfortunately, none of them is of practical use for all degree sequences, even for those with all degrees equal. In this paper we examine an algorithm which, although it does not generate uniformly at random, is provably close to a uniform generator when the degrees are relatively smal...

The IUFP Algorithm for Generating Simulation Heart

In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...